A Visual System for Compositional Relational Programming
نویسندگان
چکیده
Combilog is a compositional relational programming language that allows writing relational logic programs by functionally composing relational predicates. Higraphs, a diagram formalism is consulted to simplify some of the textual complexity of compositional relational programming to achieve a visual system that can represent these declarative meta-programs, with the final intention to design an intuitive and visually assisted complete development practice. As a proof of concept, an implementation of a two-way parser/visualizer is presented.
منابع مشابه
Graphic Representation and Visualisation as Modelling Support for the Knowledge Acquisition Process
Håkansson, A. 2003. Graphic Representation and Visualisation as Modelling Support for the Knowledge Acqusition Process. 79 pp. Uppsala. ISBN 91-506-1727-3 The thesis describes steps taken towards using graphic representation and visual modelling support for the knowledge acquisition process in knowledge-based systems — a process commonly regarded as difficult. The performance of the systems dep...
متن کاملThe Visual Transitivity System in Two ELT Books Series
The present study aims to investigate the system of the visual transitivity by analyzing the images of American English file (2014) and Cutting edge (2005) series based on Halliday’s (1976) systemic functional linguistics and Kress and van leuween’s (1997-2006) social semiotics. The system of visual transitivity refers to a type of process which determines how represented participants are label...
متن کاملCompositional Relational Programming with Name Projection and Compositional Synthesis
CombInduce is a methodology for inductive synthesis of logic programs, which employs a reversible meta-interpreter for synthesis, and uses a compositional relational target language for efficient synthesis of recursive predicates. The target language, Combilog, has reduced usability due to the lack of variables, a feature enforced by the principle of compositionality, which is at the core of th...
متن کاملLocal Variable Scoping and Kleene Algebra with Tests
We explore the power of relational semantics and equational reasoning in the style of Kleene algebra for analyzing programs with mutable, statically scoped local variables. We provide (i) a fully compositional relational semantics for a first-order programming language with constructs for local variable declaration and destructive update; and (ii) an equational proof system based on Kleene alge...
متن کاملPosynomial geometric programming problem subject to max–product fuzzy relation equations
In this article, we study a class of posynomial geometric programming problem (PGPF), with the purpose of minimizing a posynomial subject to fuzzy relational equations with max–product composition. With the help of auxiliary variables, it is converted convert the PGPF into an equivalent programming problem whose objective function is a non-decreasing function with an auxiliary variable. Some pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013